On the Approximation of Largest Common Subtrees and Largest Common Point Sets
نویسندگان
چکیده
This paper considers the approximability of the largest common subtree and the largest common subgraph problems, which have applications in molecular biology. It is shown that approximating the problems within a factor of n is NP-complete, while a general search algorithm which approximates both problems within a factor of O(n= logn) is presented. Moreover, several variants of the largest common subtree problem are studied.
منابع مشابه
An algebraic view of the relation between largest common subtrees and smallest common supertrees
The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common subtree of two trees from a smallest common supertree of them, and vice versa. These constructions are the same for isomorphic, homeomorphic, topological, and m...
متن کاملCommon Fixed-Point Theorems For Generalized Fuzzy Contraction Mapping
In this paper we investigate common xed point theorems for contraction mapping in fuzzy metric space introduced by Gregori and Sapena [V. Gregori, A. Sapena, On xed-point the- orems in fuzzy metric spaces, Fuzzy Sets and Systems, 125 (2002), 245-252].
متن کاملSome points on generalized open sets
The paper is an attempt to represent a study of limit points, boundary points, exterior points, border, interior points and closure points in the common generalized topological space. This paper takes a look at the possibilities of an extended topological space and it also considers the new characterizations of dense set.
متن کاملA new approximation method for common fixed points of a finite family of nonexpansive non-self mappings in Banach spaces
In this paper, we introduce a new iterative scheme to approximate a common fixed point for a finite family of nonexpansive non-self mappings. Strong convergence theorems of the proposed iteration in Banach spaces.
متن کاملApproximation Algorithms for the Largest Common Subtree Problem
The largest common subtree problem is to nd a largest tree which occurs as a common subgraph in a given collection of trees. Let n denote the number of vertices in the largest tree in the collection. We show that in the case of bounded degree trees, it is possible to achieve an approximation ratio of O(n(log logn)= log n). For unbounded degree trees, we give an algorithm with approximation rati...
متن کامل